Rain-Fall Optimization Algorithm with new parallel implementations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalization and Static Optimization of Parallel Implementations

| In this paper, we present a relational formalism based on graphs theory to build all the possible implementations of an algorithm onto a parallel machine. Here, the term implementation means, not only as usual, the distribution and the scheduling of the computations, as well as the distribution of the inter-processor communications , but also, and this is a crucial issue, the scheduling of th...

متن کامل

Nesterov-based Alternating Optimization for Nonnegative Tensor Factorization: Algorithm and Parallel Implementations

We consider the problem of nonnegative tensor factorization. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization (AO) framework and solve each matrix nonnegative least-squares problem via a Nesterov-type algorithm for strongly convex problems. We describe two parallel implementations of the algorithm, with and with...

متن کامل

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

A New Parallel Search Algorithm for Non-Linear Function Optimization

Abstrac/-This paper proposes a new parallel search algorithm using evolutionary programming and quasi-simplex technique (EPQS). EPQS produces the offspring from three ways in parallel: 1) Using the Gaussian mutation, 2) Using the Cauchy mutation, and 3) Using the quasi-simplex techniques. The quasi-simplex technique uses the ideal of classical simplex technique and produces four prospective ind...

متن کامل

New Optimization Approach Using Clustering-Based Parallel Genetic Algorithm

In many global Optimization Problems, it is required to evaluate a global point (min or max) in large space that calculation effort is very high. In this paper is presented new approach for optimization problem with subdivision labeling method (SLM) but in this method for higher dimensional has high calculation effort. Clustering-Based Parallel Genetic Algorithm (CBPGA) in optimization problems...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EAI Endorsed Transactions on Energy Web

سال: 2018

ISSN: 2032-944X

DOI: 10.4108/eai.13-7-2018.163981